Yellow Bricks

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modification of Yellow River Sediment Based Stabilized Earth Bricks

This paper presents an experimental study on the microstructure and performance of stabilized earth bricks prepared from the Yellow River sediment. The sediment is modified by inorganic cementitious material, polymer bonding agent, and jute fibre. The results show that the sediment is preliminarily consolidated when the mixture ratio of activated sediment/cementitious binder/sand is 65/25/10. C...

متن کامل

Building Bricks with Bricks, with Mathematica

In this work we solve a special case of the problem of building an n-dimensional parallelepiped using a given set of n-dimensional parallelepipeds. Consider the identity x = xHx 1L Hx 2L + 3 xHx 1L + x. For sufficiently large x, we associate with x3 a cube with edges of size x, with x Hx 1L Hx 2L a parallelepiped with edges x, x 1, x 2, with 3 x Hx 1L three parallelepipeds of edges x, x 1, 1, a...

متن کامل

Constructing the Yellow Brick Road: Route Bricks on Virtual Tactile Maps

Tactile maps are the standard media to convey geographical information to blind people. An approach for an interactive substitute for tactile maps is presented, called virtual tactile maps. It is based on an image processing system tracking fingers and game piece-like objects. Output is done through speech and sound. Users learn routes by constructing them with route bricks.

متن کامل

Minimal bricks

A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. A brick is minimal if for every edge e the deletion of e results in a graph that is not a brick. We prove a generation theorem for minimal bricks and two corollaries: (1) for n ≥ 5, every minimal brick on 2n vertices has at most 5n − 7 edges, and (2) every minimal br...

متن کامل

Generating bricks

A brick is a 3-connected graph such that the graph obtained from it by deleting any two distinct vertices has a perfect matching. Bricks are building blocks of the matching decomposition procedure of Kotzig, Lovasz and Plummer, and therefore many matching-related problems can be reduced to bricks. We prove, roughly, that every brick other than the Petersen graph can be generated from a “matchin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: The Journal of Physical Chemistry

سال: 1916

ISSN: 0092-7325,1541-5740

DOI: 10.1021/j150171a002